Minimal arithmetic thickness connecting discrete planes

نویسندگان

  • Damien Jamet
  • Jean-Luc Toutant
چکیده

While connected arithmetic discrete lines are entirely characterized, only partial results exist for the more general case of arithmetic discrete hyperplanes. In the present paper, we focus on the 3-dimensional case, that is on arithmetic discrete planes. Thanks to arithmetic reductions on a vector n, we provide algorithms either to determine whether a given arithmetic discrete plane with n as normal vector is connected, or to compute the minimal thickness for which an arithmetic discrete plane with normal vector n is connected.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

About thin arithmetic discrete planes

Arithmetic discrete planes are sets of integer points located within a fixed bounded distance (called thickness) of a Euclidean plane. We focus here on a class of “thin” arithmetic discrete planes, i.e., on a class of arithmetic discrete planes whose thickness is smaller than the usual one, namely the so-called standard one. These thin arithmetic discrete planes have “holes” but we consider a t...

متن کامل

Critical Connectedness of Thin Arithmetical Discrete Planes

An arithmetical discrete plane is said to have critical connecting thickness if its thickness is equal to the infimum of the set of values that preserve its 2-connectedness. This infimum thickness can be computed thanks to the fully subtractive algorithm. This multidimensional continued fraction algorithm consists, in its linear form, in subtracting the smallest entry to the other ones. We prov...

متن کامل

On the Connectedness of Rational Arithmetic Discrete Hyperplanes

While connected arithmetic discrete lines are entirely characterized by their arithmetic thickness, only partial results exist for arithmetic discrete hyperplanes in any dimension. In the present paper, we focus on 0-connected rational arithmetic discrete planes in Z. Thanks to an arithmetic reduction on a given integer vector n, we provide an algorithm which computes the thickness of the thinn...

متن کامل

On the Connecting Thickness of Arithmetical Discrete Planes

While connected rational arithmetical discrete lines and connected rational arithmetical discrete planes are entirely characterized, only partial results exist for the irrational arithmetical discrete planes. In the present paper, we focus on the connectedness of irrational arithmetical discrete planes, namely the arithmetical discrete planes with a normal vector of which the coordinates are no...

متن کامل

Fully Subtractive Algorithm, Tribonacci numeration and connectedness of discrete planes

We investigate connections between a well known multidimensional continued fraction algorithm, the so-called fully subtractive algorithm, the finiteness property for β-numeration, and the connectedness of arithmetic discrete hyperplanes. A discrete hyperplane is said to be critical if its thickness is equal to the infimum of the set of thicknesses for which discrete hyperplanes with the same no...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Discrete Applied Mathematics

دوره 157  شماره 

صفحات  -

تاریخ انتشار 2009